搜索资源列表
dstar
- D星算法，是A星算法的动态版本，都是基本的路径规划算法-D Star algorithm, stars are A dynamic version of the algorithm is the basic path planning algorithm
Dstar-Lite
- 这是用D*算法实现机器人路径规划的JAVA程序，适用于动态路径环境下，可以在未知环境中快速的找到可行路线-This is the D* algorithm for robot path planning Java program, applicable to the dynamic path environment can quickly find a feasible route in an unknown environment
dstar-lite-master
- 基于dijikstra和A*算法的改进A*算法，能在路径规划的各阶段更新节点信息，规划新的路径(The improved A* algorithm based on dijikstra and A* algorithm can update node information in all stages of path planning and plan new path.)
dstar
- D*lite算法的C++实现，已经在ubuntu linux下面测试通过！(C++ Implementation of D*lite Algorithms)
Dstar动态路径规划算法
- 用于动态路径寻优的D*算法，可以运行出完整的路径，具有一定的参考价值(D* algorithm for dynamic path optimization, can run)
DSTAR
- 基于python，dstar算法实现静态路径规划和动态路径规划(Static path planning and dynamic path planning based on Python and dstar algorithm)